By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 19, Issue 1, pp. 1-280

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a Multigraph

Harold N. Gabow

pp. 1-18

BibTeX  Abstract Full Text:  PDF

Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees

Michael Drmota and Hsien-Kuei Hwang

pp. 19-45

BibTeX  Abstract Full Text:  PDF

What Costs Are Minimized by Huffman Trees?

Gunnar Forst and Anders Thorup

pp. 46-68

BibTeX  Abstract Full Text:  PDF

Exact Minimum Density of Codes Identifying Vertices in the Square Grid

Yael Ben-Haim and Simon Litsyn

pp. 69-82

BibTeX  Abstract Full Text:  PDF

On Equitable Coloring of d-Degenerate Graphs

A. V. Kostochka, K. Nakprasit, and S. V. Pemmaraju

pp. 83-95

BibTeX  Abstract Full Text:  PDF

Computation in Noisy Radio Networks

Eyal Kushilevitz and Yishay Mansour

pp. 96-108

BibTeX  Abstract Full Text:  PDF

The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders

Marc Chardon and Aziz Moukrim

pp. 109-121

BibTeX  Abstract Full Text:  PDF

Tighter Bounds for Graph Steiner Tree Approximation

Gabriel Robins and Alexander Zelikovsky

pp. 122-134

BibTeX  Abstract Full Text:  PDF

Hamiltonian Cycles with Prescribed Edges in Hypercubes

Tomás Dvorák

pp. 135-144

BibTeX  Abstract Full Text:  PDF

On Projective Codes Satisfying the Chain Condition

Sylvia Encheva

pp. 145-148

BibTeX  Abstract Full Text:  PDF

A Random Version of Shepp's Urn Scheme

Robert W. Chen, Alan Zame, Chien-Tai Lin, and Hsiu-fen Wu

pp. 149-164

BibTeX  Abstract Full Text:  PDF

Alternative Digit Sets for Nonadjacent Representations

James A. Muir and Douglas R. Stinson

pp. 165-191

BibTeX  Abstract Full Text:  PDF

An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem

Peter Brass

pp. 192-195

BibTeX  Abstract Full Text:  PDF

Enumerating Typical Circulant Covering Projections Onto a Circulant Graph

Rongquan Feng, Jin Ho Kwak, and Young Soo Kwon

pp. 196-207

BibTeX  Abstract Full Text:  PDF

On the Structure of Graphs with Non-Surjective L(2,1)-Labelings

John P. Georges and David W. Mauro

pp. 208-223

BibTeX  Abstract Full Text:  PDF

Reversals and Transpositions Over Finite Alphabets

A. J. Radcliffe, A. D. Scott, and E. L. Wilmer

pp. 224-244

BibTeX  Abstract Full Text:  PDF

Directed Network Design with Orientation Constraints

Sanjeev Khanna, Joseph (Seffi) Naor, and F. Bruce Shepherd

pp. 245-257

BibTeX  Abstract Full Text:  PDF

On the Power of Nonlinear Secret-Sharing

Amos Beimel and Yuval Ishai

pp. 258-280

BibTeX  Abstract Full Text:  PDF